Crack Tip Interpolation, Revisited

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Crack Tip Interpolation, Revisited

It is well known that the near-tip displacement eld on a crack surface can be represented in a power series in the variable p r, where r is the distance to the tip. It is shown herein that the coe cients of the linear terms on the two sides of the crack are equal. Equivalently, the linear term in the crack opening displacement vanishes. The proof is a completely general argument, valid for an a...

متن کامل

Origin of Crack Tip

This paper demonstrates that rapid fracture of ideal brittle lattices naturally involves phenomena long seen in experiment, but which have been hard to understand from a continuum point of view. These idealized models do not mimic realistic microstructure, but can be solved exactly and understood completely. First it is shown that constant velocity crack solutions do not exist at all for a rang...

متن کامل

“Crack Kids” Revisited

IN THIS ISSUE OF THE JOURNAL, SINGER AND COLLEAGUES 1 report the findings from their prospective cohort study assessing the relationship between prenatal cocaine exposure and cognitive and developmental outcomes in 218 cocaine-exposed infants and 197 unexposed infants. After controlling for prenatal exposure to other drugs, gestational age and size at birth, and a number of caregiver characteri...

متن کامل

Crack Tip Dislocation Nucleation in FCC Solids

We present results of molecular dynamic simulations aimed at examining crack tip dislocation emission in fcc solids. The results are analyzed in terms of recent continuum formulations of this problem. In mode II, Au, Pd, and Pt displayed a new unanticipated mechanism of crack tip dislocation emission involving the creation of a pair of Shockley partials on a slip plane one plane below the crack...

متن کامل

Dynamic Interpolation Search Revisited

A new dynamic Interpolation Search (IS) data structure is presented that achieves O(log log n) search time with high probability on unknown continuous or even discrete input distributions with measurable probability of key collisions, including power law and Binomial distributions. No such previous result holds for IS when the probability of key collisions is measurable. Moreover, our data stru...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Applied Mathematics

سال: 1998

ISSN: 0036-1399,1095-712X

DOI: 10.1137/s0036139996279166